Kernel Treelets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rejoinder: Treelets

1. A multiresolution transform guided by the second-order statistics of the data. The treelet transform is a multiresolution transform that allows one to represent the original data in an alternative form. Rather than describe the data in terms of the original set of covariates we perform a series of rotations which gradually reveal the hierarchical grouping structure of the covariates. The ide...

متن کامل

Grouping of correlated feature vectors using treelets

In many applications, features are highly correlated to one another and algorithms used to construct networks from the data such as Lasso are unable to distinguish between them. Specifically, many genes in microarray gene expression data are highly correlated and knowledge of the representative groups can be useful. By using treelets, a hierarchical tree and an orthonormal basis are constructed...

متن کامل

Large-Scale Syntactic Language Modeling with Treelets

We propose a simple generative, syntactic language model that conditions on overlapping windows of tree context (or treelets) in the same way that n-gram language models condition on overlapping windows of linear context. We estimate the parameters of our model by collecting counts from automatically parsed text using standard n-gram language model estimation techniques, allowing us to train a ...

متن کامل

Discussion of Treelets by Lee, Nadler and Wasserman

The authors’ emphasis is on the method as a useful way of representing data analogous to a wavelet representation where X = X(t) with t genuinely identified with a point on the line and observartion at p time points ,but where the time points have been permuted. As such this can be viewed as a clustering method which, from their examples, gives very reasonable answers. However, to make more gen...

متن کامل

A Convolutional Treelets Binary Feature Approach to Fast Keypoint Recognition

Fast keypoint recognition is essential to many vision tasks. In contrast to the classification-based approaches [1, 2], we directly formulate the keypoint recognition as an image patch retrieval problem, which enjoys the merit of finding the matched keypoint and its pose simultaneously. A novel convolutional treelets approach is proposed to effectively extract the binary features from the patch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Data Science and Adaptive Analysis

سال: 2019

ISSN: 2424-922X,2424-9238

DOI: 10.1142/s2424922x19500062